Predictive Sequence Miner in ILP Learning

نویسندگان

  • Carlos Abreu Ferreira
  • João Gama
  • Vítor Santos Costa
چکیده

In this work we present an optimized version of XMuSer, an ILP based framework suitable to explore temporal patterns available in multi-relational databases. The main idea behind XMuSer consists of exploiting frequent sequence mining, an efficient and direct method to learn temporal patterns in the form of sequences. The efficiency of XMuSer comes from a new coding methodology and on the use of a predictive sequential miner, which finds discriminative frequent patterns. After finding the discriminative sequences, we map the most interesting ones into a new table that encodes the multi-relational temporal information. The original database is enlarged with a new table that encodes the temporal information in the form of sequences. The last step of our framework consists of applying an ILP algorithm to learn a theory on the enlarged relational database. We evaluate our framework by addressing three classification multi-relational problems. Overall, we observe clear advantages when exploiting temporal information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boosting Descriptive ILP for Predictive Learning in Bioinformatics

Boosting is an established propositional learning method to promote the predictive accuracy of weak learning algorithms, and has achieved much empirical success. However, there have been relatively few efforts to apply boosting to Inductive Logic Programming (ILP) approaches. We investigate the use of boosting descriptive ILP systems, by proposing a novel algorithm for generating classification...

متن کامل

Boosting Descriptive ILP for Predictive Learning

Inductive Logic Programming has been very successful in application to multirelational predictive tasks. Sophisticated predictive ILP systems, such as Progol and foil, can achieve high predictive accuracy, while the learning results remain understandable. Although boosting [1] is an established method to promote predictive accuracy of weak algorithms, there have been relatively few efforts to a...

متن کامل

The Construct of Interlanguage Pragmatic Learning Strategies: Investigating Preferences of High vs. Low Pragmatic Performers

Interlanguage pragmatics (ILP) has witnessed a growing body of research in the past two decades. One of the under-explored domains of L2 pragmatics is the role of learning strategies specifically tailored for the development of ILP knowledge. Therefore, this investigation aimed to determine the significant interlanguage pragmatic learning strategies (IPLS) used by high vs. low L2 pragmatic achi...

متن کامل

An Experimental Evaluation of Passage-Based Process Discovery

In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. However, the downside of the ILP Miner is that its complexity is exponential in the number of event classes in that event log. As a result, the ILP Miner may take a very long time to return a Petri net. Partitioning the traces in the event log over multipl...

متن کامل

Projection-Based PILP: Computational Learning Theory with Empirical Results

Evaluations of advantages of Probabilistic Inductive Logic Programming (PILP) against ILP have not been conducted from a computational learning theory point of view. We propose a PILP framework, projection-based PILP, in which many-to-one projection functions are used to produce a “lossy” compression dataset from an ILP dataset. We present sample complexity results including conditions when pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011